Refinement algebra with dual operator
نویسندگان
چکیده
منابع مشابه
The Dual Space of an Operator Algebra
Introduction. The purpose of this paper is to study noncommutative C*algebras as Banach spaces. The Gelfand representation of an abelian C*-algebra as the algebra of all continuous complex-valued functions on its spectrum has made it possible to apply the techniques of measure theory and the topological properties of compact Hausdorff spaces to the study of such algebras. No such structure theo...
متن کاملInvariant elements in the dual Steenrod algebra
In this paper, we investigate the invariant elements of the dual mod $p$ Steenrod subalgebra ${mathcal{A}_p}^*$ under the conjugation map $chi$ and give bounds on the dimensions of $(chi-1)({mathcal{A}_p}^*)_d$, where $({mathcal{A}_p}^*)_d$ is the dimension of ${mathcal{A}_p}^*$ in degree $d$.
متن کاملFrom Kleene Algebra to Refinement Algebra
KAT (Kleene Algebra with Tests) have proved to be useful for reasoning about programs in a partial correctness framework. We describe DRA (demonic Re nement Algebra), a variation of KAT for total correctness and illustrate its modeling and reasoning power with a number of applications and examples. TUCS Laboratory TUCS Learning and Reasoning Laboratory
متن کاملProbabilistic Demonic Refinement Algebra
We propose an abstract algebra for reasoning about probabilistic programs in a total-correctness framework. In contrast to probablisitic Kleene algebra it allows genuine reasoning about total correctness and in addition to Kleene star also has a strong iteration operator. We define operators that determine whether a program is enabled, has certain failure or does not have certain failure, respe...
متن کاملTowards squiggly refinement algebra
The algebra of functions and relations has been used so successfully in program construction that textbooks have appeared. Despite the importance of predicate transformers in imperative programming, the algebra of transformers has been less explored. To show its promise, we prove results on exponents and recursion on inductive data types, sufficient for carrying out a polytypic derivation that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2014
ISSN: 0167-6423
DOI: 10.1016/j.scico.2013.07.002